Separating sets by Fourier-Stieltjes transforms
نویسندگان
چکیده
منابع مشابه
Representation of Functions as Absolutely Convergent Fourier-stieltjes Transforms
0. Introduction. Let G be a locally compact Abelian group, and G* its group of (continuous) characters. We write (y, x) to indicate the function on G*XG which is the value of the character y EG* at the point *6G, or, dually, the value of the character xEG at the point y EG*. Borel sets in G are taken to be the smallest cr-algebra of sets containing all closed sets. We consider the set of all re...
متن کاملStieltjes transforms defined by C0-semigroups
In this paper we use the resolvent semigroup associated to a C0semigroup to introduce the vector-valued Stieltjes transform defined by a C0-semigroup. We give new results which extend known ones in the case of scalar generalized Stieltjes transform. We work with the vector-valued Weyl fractional calculus to present a deep connection between both concepts. Mathematics Subject Classification (200...
متن کاملC*-algebras Generated by Fourier-stieltjes
For G a locally compact group and G its dual, let Jd(G) be the C*algebra generated by the Fourier-Stieltjes transforms of the discrete measures on G. We show that the canonical trace on ,4(G) is faithful if and only if G is amenable as a discrete group. We further show that if G is nondiscrete and amenable as a discrete group, then the only measures in dKd(G) are the discrete measures, and also...
متن کامل2 Generalized Cauchy - Stieltjes Transforms and Markov Transforms
We express the generalized Cauchy-Stieltjes transforms of some particular Beta distributions depending on a positive parameter λ as λ-powered Cauchy-Stieltjes transforms of some probability measures. The Cauchy-Stieltjes transforms of the latter measures are shown to be the geometric mean of the Cauchy-Stieltjes transform of the Wigner law together with another one. Moreover, they are absolutel...
متن کاملComputation of Convolutions and Discrete Fourier Transforms by Polynomial Transforms
Discrete transforms are introduced and are defined in a ring of polynomials. These polynomial transforms are shown to have the convolution property and can be computed in ordinary arithmetic, without multiplications. Polynomial transforms are particularly well suited for computing discrete two-dimensional convolutions with a minimum number of operations. Efficient algorithms for computing one-d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 1989
ISSN: 0022-1236
DOI: 10.1016/0022-1236(89)90099-2